Multipartite Quantum Correlation and Communication Complexities

Approximate and Multipartite Quantum Correlation (Communication) Complexity

The concepts of quantum correlation and communication complexity have been proposed to quantify the worst-case computational resources needed in generating bipartite classical distributions or bipartite quantum states in the single-shot setting by Zhang (Proc. 3rd Innov Theor Comput., pp. 39-59, 2012). The former characterizes the minimal size of the initial shared state needed if no communicat...

Nondeterministic Quantum Query and Quantum Communication Complexities

We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f (x) = 1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a Boolean function is equal to its " nondeterministic polynomial " degree. We also prove a quantum-vs.-classical gap of 1 vs. n for nondeterministic query c...

Nondeterministic Quantum Query and Communication Complexities

Evaluating measures of nonclassical correlation in a multipartite quantum system

Akira SaiToh, Robabeh Rahimi, and Mikio Nakahara 1 Department of Systems Innovation, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka 560-8531, Japan [email protected] 2 Research Center for Quantum Computing, Interdisciplinary Graduate School of Science and Engineering, Kinki University, Higashi-Osaka, Osaka 577-8502, Japan [email protected] 3 D...

Explicit circuits for quantum communication through multipartite cluster states

Quantum circuits are provided for realizing quantum communicational protocols involving teleportation and quantum information splitting (QIS) of single and two qubit states. We explicate these protocols through cluster states as the same is experimentally achievable. We describe quantum circuits for realizing the four and five partite cluster states using well known gates in quantum information...